基于GFU和分层LSTM的组群行为识别研究方法

提出一种以"关键人物"为核心，使用门控融合单元（GFU，Gated Fusion Unit）进行特征融合的组群行为识别框架，旨在解决两个问题：①组群行为信息冗余，重点关注关键人物行为特征，忽略无关人员对组群行为的影响；②组群内部交互行为复杂，使用GFU有效融合以关键人物为核心的交互特征，再通过LSTM时序建模成为表征能力更强的组群特征.最终，通过softmax分类器进行组群行为类别分类.该算法在排球数据集上取得了86.7%的平均识别率.     

Chemical-Shift Perturbations Reflect Bile Acid Binding to Norovirus Coat Protein: Recognition Comes in Different Flavors

Bile acids have been reported as important cofactors promoting human and murine norovirus (NoV) infections in cell culture. The underlying mechanisms are not resolved. Through the use of chemical shift perturbation (CSP) NMR experiments, we identified a low-affinity bile acid binding site of a human GII.4 NoV strain. Long-timescale MD simulations reveal the formation of a ligand-accessible binding pocket of flexible shape, allowing the formation of stable viral coat protein–bile acid complexes in agreement with experimental CSP data. CSP NMR experiments also show that this mode of bile acid binding has a minor influence on the binding of histo-blood group antigens and vice versa. STD NMR experiments probing the binding of bile acids to virus-like particles of seven different strains suggest that low-affinity bile acid binding is a common feature of human NoV and should therefore be important for understanding the role of bile acids as cofactors in NoV infection.     

一种高误码(n,k,m)非系统卷积码盲识别算法

针对信息截获等领域中的卷积码盲识别问题，提出一种高误码 (n,k,m)非系统卷积码盲识别算法。首先建立可变的数据矩阵模型，对侦收到的数据进行相关预处理，以减小误码对识别的影响，提高算法的容错性能；再对预处理后的数据矩阵进行统计分析，识别出卷积码的各项参数，并提取各个数据矩阵的校验序列；进而利用校验序列构建线性方程组求解生成多项式矩阵组，通过设定筛选生成多项式矩阵的条件，筛选出非系统卷积码的生成多项式矩阵，最终完成对非系统卷积码的识别。仿真实验表明，该算法可以对高误码(n,k,m)非系统卷积码实现有效的盲识别。     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

一种广义不可分支持向量机算法

针对标准的C-SVM(C-support vector machine)算法在处理很多实际分类问题时，对识别错误代价损失差异很大的极端情况表现出的局限性，提出一种通用的 广义支持向量机算法。根据识别错误后所付出的代价，可以把最优分类面向代价损失低的一方进行推移，留给代价损失高的一方更大的空间，提高其识别率，从而减小识别错误后带来的代价损失。该方法进一步提高了标准C SVM的适用性以及样本的正确识别率，将新算法应用到高分辨雷达距离像的识别中，实验证明,广义C-SVM能取得比传统C-SVM更好的识别效果。     

基于机器视觉的运煤车车号识别技术研究

在铁路运煤装车过程中为了快速、准确地识别车号,提出一种基于机器视觉的运煤车车号识别技术。将连通区域提取与投影分割法结合,实现车号的粗定位、细分割,并对图像中的断裂字符进行二次分割,构建了基于BP神经网络的分类模型进行车号识别,提升了煤炭装车的效率和精度。     

Fingerprint optimization method for the indoor localization system

The accuracy of the indoor localization is influenced directly by the quality of the fingerprint. But the indoor localization algorithms in existence are almost conducted based on the original fingerprint which is not optimized. The k-means is introduced to optimize the fingerprint in this paper. And deleting the collected bad-points through the theory of cluster could make the fingerprint more accurate for the indoor localization algorithm. Compared with the indoor localization systems in existence, the result of experiments shows that the optimized fingerprint can increase the accurate of indoor localization with a higher probability.     

A self-adaptive weighted affinity propagation clustering for key frames extraction on human action recognition

In this paper, we propose a novel approach for key frames extraction on human action recognition from 3D video sequences. To represent human actions, an Energy Feature (EF), combining kinetic energy and potential energy, is extracted from 3D video sequences. A Self-adaptive Weighted Affinity Propagation (SWAP) algorithm is then proposed to extract the key frames. Finally, we employ SVM to recognize human actions on the EFs of selected key frames. The experiments show the information including whole action course can be effectively extracted by our method, and we obtain good recognition performance without losing classification accuracy. Moreover, the recognition speed is greatly improved.     

A novel approach for efficient stance detection in online social networks with metaheuristic optimization

In the 19th and 20th centuries, social networks have been an important topic in a wide range of fields from sociology to education. However, with the advances in computer technology in the 21st century, significant changes have been observed in social networks, and conventional networks have evolved into online social networks. The size of these networks, along with the large amount of data they generate, has introduced new social networking problems and solutions. Social network analysis methods are used to understand social network data. Today, several methods are implemented to solve various social network analysis problems, albeit with limited success in certain problems. Thus, the researchers develop new methods or recommend solutions to improve the performance of the existing methods. In the present paper, a novel optimization method that aimed to classify social network analysis problems was proposed. The problem of stance detection, an online social network analysis problem, was first tackled as an optimization problem. Furthermore, a new hybrid metaheuristic optimization algorithm was proposed for the first time in the current study, and the algorithm was compared with various methods. The analysis of the findings obtained with accuracy, precision, recall, and F-measure classification metrics demonstrated that our method performed better than other methods.